Epsilon substitution for transfinite induction
نویسنده
چکیده
We apply Mints’ technique for proving the termination of the epsilon substitution method via cut-elimination to the system of Peano Arithmetic with Transfinite Induction given by Arai.
منابع مشابه
The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program
After a brief flirtation with logicism in 1917–1920, David Hilbert proposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays and Wilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for ever stronger and more comprehensive areas of mathematics and ...
متن کاملFast-Collapsing Theories
Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods and transfinite induction up to a smaller ordinal.
متن کاملEpsilon Numbers and Cantor Normal Form
An epsilon number is a transfinite number which is a fixed point of an exponential map: ω ε = ε. The formalization of the concept is done with use of the tetration of ordinals (Knuth's arrow notation, ↑↑). Namely, the ordinal indexing of epsilon numbers is defined as follows: ε0 = ω ↑↑ ω, εα+1 = εα ↑↑ ω, and for limit ordinal λ: ε λ = lim α<λ εα = α<λ εα. Tetration stabilizes at ω: α ↑↑ β = α ↑...
متن کاملA Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms
We generalize the Knuth–Bendix order (KBO) to higher-order terms without λ-abstraction. The restriction of this new order to first-order terms coincides with the traditional KBO. The order has many useful properties, including transitivity, the subterm property, compatibility with contexts (monotonicity), stability under substitution, and well-foundedness. Transfinite weights and argument coeff...
متن کاملArithmetical transfinite induction and hierarchies of functions
We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris–Harrington Theorem, and a version of the Solovay–Ketonen Theorem. We give uniform proofs using combinatorial constructions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 44 شماره
صفحات -
تاریخ انتشار 2005